To Propose a Reviewer Dispatching Algorithm for Network Peer Assessment System

Despite their increasing availability on the Internet, networked peer assessment systems lack feasible automatic dispatching algorithm of student's assignments and ultimately inhibit the effectiveness of peer assessment. Therefore, this study presents a reviewer dispatching algorithm capable of supporting networked peer assessment system in order to automatically dispatch student's assignments to their peer reviewers. Reviewer Dispatching Algorithm We set four constraints for dispatching reviewers. The first is that author should not review his (or her) own assignment. The second is that how many reviewers per assignment should set up via instructor. The third is that how many reviewers per assignment should equal to how many assignments reviewed by each student. The forth is that the reviewers of first assignment are fixed under k rounds but the reviewers of second or another assignment should be different to maintain the fairness. Then, we would like to model these constraints via constraint satisfaction problem. In order to illustrate this process in an easy way, we hypothesized that when there are three students. In the first step, we write down a 3x2 matrix (Table 1). Col1 Col2 Student1 X1 X2 Student2 X3 X4 Student3 X5 X6 Table 1: A 3x2 matrix for modeling the constraints